Length estimators for digitized contours
نویسندگان
چکیده
منابع مشابه
Length estimators for digitized contours
The estimation of the length of a continuous curve from discrete data is considered. For ideal straight chaincode strings, optimal estimators are given. Comparisons are performed with known methods and recommendations given. A sampling density vs. accuracy trade-off theorem is presented. The applicability to nonstraight strings is discussed. For curves that may be considered to be composed of c...
متن کاملEstimators for Orientation and Anisotropy in Digitized Images
This paper describes a technique for characterization and segmentation of anisotropic patterns that exhibit a single local orientation. Using Gaussian derivatives we construct a gradient-square tensor at a selected scale. Smoothing of this tensor allows us to combine information in a local neighborhood without canceling vectors pointing in opposite directions. Whereas opposite vectors would can...
متن کاملAbout Multigrid Convergence of Some Length Estimators
An interesting property for curve length digital estimators is the convergence toward the continuous length and the associate convergence speed when the digitization step h tends to 0. On the one hand, it has been proved that the local estimators do not verify this convergence. On the other hand, DSS and MLP based estimators have been proved to converge but only under some convexity and smoothn...
متن کاملA Comparative Evaluation of Length Estimators
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experim...
متن کاملLocal Versus Non-local Computation of Length of Digitized Curves
In this paper, we consider the problem of computing the length of a curve from digitized versions of the curve using parallel computation. Our aim is to study the inherent parallel computational complexity of this problem as a function of the digitization level. Precise formulations for the digitization, the parallel computation, and notions of local and nonlocal computations are given. We show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision, Graphics, and Image Processing
سال: 1987
ISSN: 0734-189X
DOI: 10.1016/s0734-189x(87)80194-9